c(b(a(X))) → a(a(b(b(c(c(X))))))
a(X) → e
b(X) → e
c(X) → e
↳ QTRS
↳ DependencyPairsProof
c(b(a(X))) → a(a(b(b(c(c(X))))))
a(X) → e
b(X) → e
c(X) → e
C(b(a(X))) → A(a(b(b(c(c(X))))))
C(b(a(X))) → B(b(c(c(X))))
C(b(a(X))) → C(X)
C(b(a(X))) → B(c(c(X)))
C(b(a(X))) → A(b(b(c(c(X)))))
C(b(a(X))) → C(c(X))
c(b(a(X))) → a(a(b(b(c(c(X))))))
a(X) → e
b(X) → e
c(X) → e
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
C(b(a(X))) → A(a(b(b(c(c(X))))))
C(b(a(X))) → B(b(c(c(X))))
C(b(a(X))) → C(X)
C(b(a(X))) → B(c(c(X)))
C(b(a(X))) → A(b(b(c(c(X)))))
C(b(a(X))) → C(c(X))
c(b(a(X))) → a(a(b(b(c(c(X))))))
a(X) → e
b(X) → e
c(X) → e
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
C(b(a(X))) → C(X)
c(b(a(X))) → a(a(b(b(c(c(X))))))
a(X) → e
b(X) → e
c(X) → e
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
C(b(a(X))) → C(X)
The value of delta used in the strict ordering is 4.
POL(C(x1)) = x_1
POL(a(x1)) = (4)x_1
POL(b(x1)) = 4 + (1/4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
c(b(a(X))) → a(a(b(b(c(c(X))))))
a(X) → e
b(X) → e
c(X) → e